搜索资源列表
depth-first-algorithm
- 数据结构经典算法C++实现（五）：深度优先（邻接矩阵，递归）算法-Data structures classical algorithm C++ of realization (e): depth-first (recursive) algorithm, the adjacency matrix
ApplicationsOfDepth-FirstTraversal
- 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。 通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DFS to test if a given undirecte
8queens
- 这是八皇后算法，自己写的，但是主题思想一样，深度优先，大家参考-This is the eight Queen s algorithm, wrote it myself, but the main idea, the depth-first, we refer to
asp
- ASP.NET书稿源代码 第三篇：ASP.NET编程深入举例 第二篇：HTML控件和WEB控件应用举例 第一篇：走进ASP.NET的世界-ASP.NET source code of the third book: ASP.NET programming the second depth, for example: HTML controls and application controls, for example WEB first: into the world of ASP.
depthfirst
- implement depth first algorithm
Depth-First-Traverse
- 此代码为“图的深度优先遍历”的源代码，图的存储形式为邻接矩阵，里面有图的邻接矩阵存储的代码，有深度优先遍历的算法，还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traver
DFS
- 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
SFTW461-AI2_Assignment_2_DA627764
- DFS A depth-first search program that avoids cycling. solve( Node, Solution): Solution is an acyclic path (in reverse order) between Node and a goal-DFS A depth-first search program that avoids cycling. solve( Node, Solution): So
dfsorigin
- DFS in Matlab, Depth First Search
brainee-30177
- An application that implement Uninformed search algorithms * Breadth-first search * Uniform-cost search * Depth-first search * Depth-limited search (tree and recursive versions) * Iterative deepening search-An application that im
DFS
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
Depth-First-Search
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
Depth-first-search
- 深度优先搜索的搜索过程类似树的先序遍历，也叫回溯法。-Depth-first search of the search process similar to the preorder traversal of the tree, also known as backtracking.
depth-first
- 可以实现树的深度优先遍历，编译通过，可以即时使用。-It Can achieve a depth-first traversal of the tree, compile, and can immediately use
graph-depth-first-search
- 基于VC6.0，实现图的深度优先搜索算法-graph depth-first search
Depth-first-traversal
- 1、编写图的邻接表表示法的数据结构。 2、编写用邻接表创建图的函数 3、用深度优先遍历的方法输出顶点序列-1, write the adjacency table shows the data structure of the Act. 2, written with the adjacent table to create a graph function output sequence of vertices with a depth-first traversal methods
Depth-First-Search
- 个人实现的深度优先搜索代码。水平有限，请大家指正。-Implementation of a depth-first search algorithm.
depth-first-traversal
- 这是一个数据结构中二叉树的邻接链表的建立以及广度优先遍历和深度优先遍历的算法，对于初学者来说，这样的算法简单易懂，非常容易上手-This is to establish and breadth of a binary tree data structure adjacency list first traversal and depth-first traversal algorithm, for starters, this algorithm is simple to understand
depth-first-search
- 基于C语言的数据结构与算法分析：深度优先搜索-Based on data structures and algorithms in C language analysis: depth-first search
Maze-depth-first-algorithm
- 迷宫深度优先算法，深度优先是按照一定的顺序查找完一个分支，再查找另外一个分支，直到找到目标为止。-Depth first is according to certain order to find a branch, then find another branch, until find the target.